Russell Impagliazzo - PDFSEARCH.IO - Document Search Engine

Russell Impagliazzo
Results: 30

#	Item
21	The Complexity of Unique -SAT: An Isolation Lemma for -CNFs Chris Calabro Russell Impagliazzo £ Valentine Kabanets Ý Ramamohan PaturiÞ Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2013-10-01 17:38:07
22	2015 Knuth Prize Citation for L´ aszl´ o Babai The 2015 Donald E. Knuth Prize is awarded to L´aszl´o Babai of the University of Chicago for his fundamental contributions to theoretical computer science, including alg Add to Reading List Source URL: www.sigact.org Language: English - Date: 2015-05-26 18:25:25 Probabilistic complexity theory Theoretical computer science Morphisms Computational complexity theory PCP theorem Mathematical optimization Probabilistically checkable proof Combinatorica IP Algorithm Russell Impagliazzo Graph isomorphism
23	An Axiomatic Approach to Algebrization Russell Impagliazzo∗ Valentine Kabanets† Antonina Kolokolova‡ Add to Reading List Source URL: www.cs.mun.ca Language: English - Date: 2009-10-26 17:21:04
24	Computational Complexity Fifteenth Annual IEEE Conference ADVANCE REGISTRATION FORM Add to Reading List Source URL: computationalcomplexity.org Language: English - Date: 2012-08-02 12:27:54 ACM SIGACT Lance Fortnow Average-case complexity Russell Impagliazzo Decision tree model Quantum information science Computer science Richard Cleve Complexity Theoretical computer science Applied mathematics Computational complexity theory
25	Monday, July 17 9:30-10:30 G¨ odel and Computations, Pavel Pudlak 10:30-11:00 Coffee 11:00-11:30 Polynomial Identity Testing for Depth 3 Circuits, Neeraj Kayal, Nitin Saxena Add to Reading List Source URL: computationalcomplexity.org Language: English - Date: 2012-07-28 21:08:59 Complexity classes Quantum complexity theory Russell Impagliazzo Circuit complexity PP PH Arthur–Merlin protocol Low Advice Theoretical computer science Computational complexity theory Applied mathematics
26	A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA[removed] Add to Reading List Source URL: www.karlin.mff.cuni.cz Language: English - Date: 2011-12-13 09:31:41 Complexity classes Mathematical optimization Structural complexity theory Analysis of algorithms P versus NP problem NP-complete NP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
27	The Complexity of Unique -SAT: An Isolation Lemma for -CNFs Chris Calabro Russell Impagliazzo Valentine Kabanets Ramamohan Paturi Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2007-10-29 20:04:40 NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Conjunctive normal form Local search PP NP-complete Theoretical computer science Computational complexity theory Applied mathematics
28	A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA[removed] Add to Reading List Source URL: stuff.mit.edu Language: English - Date: 2009-05-25 23:54:59 Complexity classes Mathematical optimization Structural complexity theory Analysis of algorithms P versus NP problem NP-complete NP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
29	In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time Russell Impagliazzo∗ Add to Reading List Source URL: www.math.ias.edu Language: English - Date: 2003-11-18 15:48:52 Complexity classes Computational resources Pseudorandomness Analysis of algorithms Advice Bounded-error probabilistic polynomial NTIME Pseudorandom generator Circuit complexity Theoretical computer science Computational complexity theory Applied mathematics
30	PDF Document Add to Reading List Source URL: www1.cs.columbia.edu Language: English - Date: 2009-04-05 12:14:36 Probabilistic complexity theory Pseudorandomness Algorithmic information theory Pseudorandom generator Average-case complexity Information-theoretic security Randomized algorithm Russell Impagliazzo List decoding Theoretical computer science Applied mathematics Computational complexity theory